Generalized Inclusion Dependencies in XML
نویسندگان
چکیده
Integrity constraints play a fundamental role in defining semantics in both conventional databases and in XML documents. In this paper we generalize previous approaches to defining inclusion dependencies in XML. Previous approaches have considered only the case where the paths on the l.h.s. are child attributes of the same node and the paths on the r.h.s. of the dependency are child attributes of the same node, whereas we do not apply this restriction. We then give an axiom system for XINDs and prove that the system is sound and complete. As a corollary, we also show that the implication problem for XINDs is decidable. Finally we consider the relationship between inclusion dependencies in relational databases (INDs) and XINDs in XML documents and we show that for a very general class of mappings from a relational database to a set of XML documents, and IND is satisfied in a relational database if and only if the corresponding XIND is satisfied in the XML documents.
منابع مشابه
Discover Dependencies from Data - A Review
Functional and inclusion dependency discovery is important to knowledge discovery, database semantics analysis, database design, and data quality assessment. Motivated by the importance of dependency discovery, this paper reviews the methods for functional dependency, conditional functional dependency, approximate functional dependency and inclusion dependency discovery in relational databases ...
متن کاملInclusion Dependencies in XML: Extending Relational Semantics
In this article we define a new type of integrity constraint in XML, called an XML inclusion constraint (XIND), and show that it extends the semantics of a relational inclusion dependency. This property is important in areas such as XML publishing and ‘data-centric’ XML, and is one that is not possessed by other proposals for XML inclusion constraints. We also investigate the implication and co...
متن کاملNeT & CoT: Inferring XML Schemas from Relational World
With XML emerging as the data format of the Internet era, there is a substantial increase in the amount of data encoded in XML. However, the majority of everyday data is still stored and maintained in relational databases. Therefore, we expect the needs to convert such relational data into XML documents will grow substantially as well. Two conversion algorithms, called NeT and CoT, to translate...
متن کاملDetecting XML Functional Dependencies through Formal Concept Analysis
As XML becomes a popular data representation and exchange format over the web, XML schema design has become an important research area. Formal Concept Analysis (FCA) has been widely applied in many fields recently. In this paper, we propose the application of FCA to find functional dependencies (FDs) in XML databases. Our work is based on the definitions of the Generalized Tree Tuple, XML funct...
متن کاملSchema Conversion Methods between XML and Relational Models
In this chapter, three semantics-based schema conversion methods are presented: 1) CPI converts an XML schema to a relational schema while preserving semantic constraints of the original XML schema, 2) NeT derives a nested structured XML schema from a flat relational schema by repeatedly applying the nest operator so that the resulting XML schema becomes hierarchical, and 3) CoT takes a relatio...
متن کامل